Parallel Mri Reconstruction Using Svd-and- Laplacian Transform Based Sparsity Regularization
نویسندگان
چکیده
The SENSE model with sparsity regularization acts as an unconstrained minimization problem to reconstruct the MRI, which obtain better reconstruction results than the traditional SENSE. To implement the sparsity constraints, discrete wavelet transform (DWT) and total variation (TV) are common exploited together to sparsify the MR image. In this paper, a novel sparsifying transform based on the combination of singular value decomposition (SVD) and Laplacian (LP) transform is proposed for parallel MR image reconstruction. The proposed algorithm adopts the SVD of the MR image as sparsifying transform instead of exploiting the wavelet domain sparsity of the image, and uses the LP-norm as an alternative to TV-norm in the sparsity regularization term. The performances of the proposed method are evaluated on two typical types of MR image (complex brain MR image and sparse angiogram MR image). Compared with the DWT-TV sparsifying transform, the proposed SVD-LP method can significantly achieve better reconstruction quality and considerably improve the computation efficiency.
منابع مشابه
MRI reconstruction with joint global regularization and transform learning
Sparsity based regularization has been a popular approach to remedy the measurement scarcity in image reconstruction. Recently, sparsifying transforms learned from image patches have been utilized as an effective regularizer for the Magnetic Resonance Imaging (MRI) reconstruction. Here, we infuse additional global regularization terms to the patch-based transform learning. We develop an algorit...
متن کاملLocal sparsity enhanced compressed sensing magnetic resonance imaging in uniform discrete curvelet domain
BACKGROUND Compressed sensing(CS) has been well applied to speed up imaging by exploring image sparsity over predefined basis functions or learnt dictionary. Firstly, the sparse representation is generally obtained in a single transform domain by using wavelet-like methods, which cannot produce optimal sparsity considering sparsity, data adaptivity and computational complexity. Secondly, most s...
متن کاملBlock-Based Compressive Sensing Using Soft Thresholding of Adaptive Transform Coefficients
Compressive sampling (CS) is a new technique for simultaneous sampling and compression of signals in which the sampling rate can be very small under certain conditions. Due to the limited number of samples, image reconstruction based on CS samples is a challenging task. Most of the existing CS image reconstruction methods have a high computational complexity as they are applied on the entire im...
متن کاملIterative CT Reconstruction Using Curvelet-Based Regularization
There is a critical need to reconstruct clinically usable images at a low dose. One way of achieving this is to reconstruct with as few projections as possible. Due to the undersampling, streak artifacts degrade image quality for traditional CT reconstruction. Compressed sensing (CS) [1] theory uses sparsity as a prior and improves the reconstruction quality considerably using only few projecti...
متن کاملAdaptive Compressed Sensing MRI
INTRODUCTION Most of the prior work in compressed sensing MRI has been based on pre-defined transformations to sparsify image representations, e.g. discrete cosine transforms (DCT), wavelets, and finite differences [1]. Even though an analytical transformation usually features a fast implementation, its performance as a sparsifying transform is limited by the underlying basis functions, which t...
متن کامل